Early Termination of Dantzig-Wolfe Algorithm for Economic MPC

نویسندگان

Laura Standardi

Leo Emil Sokoler

Niels Kjølstad Poulsen

John Bagterp Jørgensen

چکیده

In this paper we apply the Economic Model Predictive Control (MPC) for balancing the power supply and demand in the future power systems in the most economic way. The control problem is formulated as a linear program, having a block-angular structure solved by the implementation of the Dantzig-Wolfe decomposition. For real-time applications we introduce an early termination technique. Simulations demonstrate that the algorithm developed operates efficiently a power system, reducing significantly computational time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dantzig-Wolfe Decomposition Algorithm for Linear Economic MPC of a Power Plant Portfolio

Future power systems will consist of a large number of decentralized power producers and a large number of controllable power consumers in addition to stochastic power producers such as wind turbines and solar power plants. Control of such large scale systems requires new control algorithms. In this paper, we formulate the control of such a system as an Economic Model Predictive Control (MPC) p...

متن کامل

A Reduced Dantzig-Wolfe Decomposition for a Suboptimal Linear MPC

Linear Model Predictive Control (MPC) is an efficient control technique that repeatedly solves online constrained linear programs. In this work we propose an economic linear MPC strategy for operation of energy systems consisting of multiple and independent power units. These systems cooperate to meet the supply of power demand by minimizing production costs. The control problem can be formulat...

متن کامل

A Dantzig-Wolfe Decomposition Algorithm for Economic MPC of Distributed Energy Systems

In economic model predictive control of distributed energy systems, the constrained optimal control problem can be expressed as a linear program with a block-angular structure. In this paper, we present an efficient Dantzig-Wolfe decomposition algorithm specifically tailored to problems of this type. Simulations show that a MATLAB implementation of the algorithm is significantly faster than sev...

متن کامل

Inexact Cuts in Benders Decomposition

Benders' decomposition is a well-known technique for solving large linear programs with a special structure. In particular it is a popular technique for solving multi-stage stochastic linear programming problems. Early termination in the subproblems generated during Benders' decomposition (assuming dual feasibility) produces valid cuts which are inexact in the sense that they are not as constra...

متن کامل